0, 1/2-Cuts and the Linear Ordering Problem: Surfaces That Define Facets

نویسنده

  • Samuel Fiorini
چکیده

We find new facet-defining inequalities for the linear ordering polytope generalizing the well-known Möbius ladder inequalities. Our starting point is to observe that the natural derivation of the Möbius ladder inequalities as {0, 1 2 }-cuts produces triangulations of the Möbius band and of the corresponding (closed) surface, the projective plane. In that sense, Möbius ladder inequalities have the same ‘shape’ as the projective plane. Inspired by the classification of surfaces, a classic result in topology, we prove that a surface has facet-defining {0, 1 2 }-cuts of the same ‘shape’ if and only if it is nonorientable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A useful characterization of the feasible region of binary linear programs

In view of providing an explicit representation of the convex hull by listing all the facets, it is interesting to describe the integral feasible region in terms of interior points, i.e. hypercube vertices which are feasible in (1) and such that all their adjacent hypercube vertices are also feasible in (1) and exterior points, for which there is at least one infeasible adjacent hypercube verte...

متن کامل

More facets from fences for linear ordering and acyclic subgraph polytopes

We present new facets for the linear ordering polytope. These new facets generalize facets induced by subgraphs called fences, introduced by Grijtschel et al. (1985) and augmented fences, introduced by McLennan (1990). One novelty of the facets introduced here is that each subgraph induces not one but a family of facets, which are not generally rank inequalities. Indeed, we provide the smallest...

متن کامل

Solution of the Linear Ordering Problem (NP=P)

j=1 cijxij s. t. 0 6 xij 6 1, xij + xji = 1, 0 6 xij + xjk − xik 6 1, i 6= j, i 6= k, j 6= k, i, j, k = 1, ..., n. We denote the corresponding polytope by Bn. The polytope Bn has integer vertices corresponding to feasible solutions of the linear ordering problem as well as non-integer vertices. We denote the polytope of integer vertices as Pn. Let us give an example of non-integer vertex in Bn ...

متن کامل

Graph Coloring Facets from All-Different Systems

We explore the idea of obtaining valid inequalities for a 0-1 model from a constraint programming formulation of the problem. In particular, we formulate a graph coloring problem as a system of alldifferent constraints. By analyzing the polyhedral structure of alldiff systems, we obtain facet-defining inequalities that can be mapped to valid cuts in the classical 0-1 model of the problem. We fo...

متن کامل

On the membership problem for the {0, 1/2}-closure

In integer programming, {0, 1/2}-cuts are Gomory–Chvátal cuts that can be derived from the original linear system by using coefficients of value 0 or 1/2 only. The separation problem for {0, 1/2}-cuts is strongly NP-hard. We show that separation remains strongly NP-hard, even when all integer variables are binary. © 2011 Elsevier B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2006